Probabilistic Analysis of Algorithms for Dual Bin Packing Problems

On Multi-dimensional Packing Problems

line and oo-line approximation algorithms for vector covering problems. analysis of algorithms for dual bin packing problems. packing can be solved within 1 + in linear time.gorithms for the m-dimensional 0-1 knapsack problem: worst-case and probabilistic analyses.schatz. Resource scheduling in enhanced pay-per-view continuous media databases. An eecient approximation scheme for the one-dimensi...

A probabilistic analysis of the dual bin packing problem

In the dual bin packing problem, the objective is to assign items of given size to the largest possible number of bins, subject to the constraint that the total size of the items assigned to any bin is at least equal to 1. We carry out a probabilistic analysis of this problem under the assumption that the items are drawn independently from the uniform distribution on [0,1], and reveal the conne...

The Maximum Resource Bin Packing Problem

Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number or total size of accepted items. This paper presents results for the opposite problems, where we would like to maximize the number of bins used or minimize the number or total size of accepted items. We consider off-line and on-line variants of the pr...

Asymptotic Methods in the Probabilistic Analysis of Packing and Partitioning Algorithms

Traditionally, the analysis of computer algorithms has concentrated on combinatorial methods, with the primary objective being worst-case performance bounds. However, in the last 10 years there has been a dramatic increase in the probabilistic analysis of algorithms. One reason is obvious and suggests that the trend will continue: the statistical behavior of an algorithm and the objective it pr...

Probabilistic Analysis of a Generalized Bin Packing Problem and Applications